关于模N的原根与它的逆的差的奇数幂及其推广

本文研究了模ｎ的原根ａ与它的逆ａ差的奇数幂分布性质，并给出了(?)的一个渐近公式．     

Bounds for the expectation of the kth root of a random variable

Exact bounds for the mean value of a fractional moment, such as the sample standard deviation, are considered. These bounds are compared with those found by summation techniques applied to computer extended series. An expansion involving an arbitrary parameter is introduced, and now best bounds are found by optimization. There are applications to bounds for a certain class of quadrature problem.     

关于正则图直径上界的加强

设G为n阶κ正则简单连通图（κ≥2)，λ是图G的次根，d(G)是图G的直径，如果G不是二部图，且d(G)≠2，则d(G)≤[log(n-1)/log(κ/λ)]，并且当G≌时，这一上界可达．     

一般多项式零点的新估计

本文给出了一般多项式根的上下界估计,所得结果与文[1～4]中给出的估计式互不包含     

Markov Chains with finite convergence time

We study the properties of finite ergodic Markov Chains whose transition probability matrix P is singular. The results establish bounds on the convergence time of P^m to a matrix where all the rows are equal to the stationary distribution of P. The results suggest a simple rule for identifying the singular matrices which do not have a finite convergence time. We next study finite convergence to the stationary distribution independent of the initial distribution. The results establish the connection between the convergence time and the order of the minimal polynomial of the transition probability matrix. A queuing problem and a maintenance Markovian decision problem which possess the property of rapid convergence are presented.     

Charge transfer inpp collisions according to a mixed two component model

The charge transfer from one hemisphere to the other, observed inpp-collisions is explained on the basis of a ‘mixed two component’ model, which has been proposed previously to account for the multiplicity distribution of charged particles. Results of the calculations, based on the model, for various measurable quantities relating to charge transfer are compared with the available experimental data.     

Computing the real roots of a polynomial by the exclusion algorithm

We describe a new algorithm for localizing the real roots of a polynomialP(x). This algorithm determines intervals on whichP(x) does not possess any root. The remainder set contains the real roots ofP(x) and can be arbitrarily small.     

Is the rigid-body assumption reasonable?: Insights into the effects of dynamics on the electrostatic analysis of barnase-barstar

Electrostatically-driven association of proteins is important to many biological functions, and understanding which amino acid residues contribute to these interactions is crucial to protein design. Theoretical calculations that are used to elucidate the role of electrostatics in association are typically based on a single experimentally determined protein structure, while an underlying rigid-body assumption is adopted. The goal of this study was to investigate the role of conformational fluctuations on electrostatic interaction energies, as applied to the electrostatic analysis of barnase-barstar. For our calculations, we apply theoretical alanine-scan mutagenesis to introduce charge perturbations by replacing every ionizable residue with alanine, one at a time. Electrostatic clustering and free energy calculations based on the Poisson-Boltzmann method are used to evaluate the effects of each perturbation. Molecular dynamics simulations are performed for the barnase-barstar parent complex and seven experimental alanine mutations from the literature, in order to introduce relaxation before and after mutation. We discuss the effects of dynamics, in the form of pre- and post-mutation relaxation, on electrostatic clustering and free energies of association in light of experimental data. We also examine the utility of nine electrostatic similarity methods for clustering of barnase alanine-scan mutants. Our calculations suggest that the rigid-body assumption is reasonable for electrostatic calculations of barnase-barstar.     

Efficient Computation of Roots in Finite Fields

We present an algorithm to compute rth roots in $\mathbb{F}_{q^m}We present an algorithm to compute rth roots in with complexity ?[(log m + r log q) m log q] if (m,q) = 1 and either (q(q−1),r) = 1 or r|(q−1) and ((q−1)/r,r) = 1. This compares well to previously known algorithms, which need O(r m³ log³ q) steps. Paulo S. L. M. Barreto: Supported by Scopus Tecnologia S. A. José Felipe Voloch: Supported by NSA grant MDA904-03-1-0117.     

On the Abel Basis Property of the System of Root Vector-Functions of Degenerate Elliptic Differential Operators with Singular Matrix Coefficients

We establish completeness and summability in the Abel-Lidskii sense for the system of root vector-functions of nonselfadjoint elliptic matrix operators A generated by noncoercive forms with the Dirichlet-type boundary conditions. An operator A + βE is positive for a sufficiently large β > 0 but not strongly positive in general. We obtain estimates for the eigenvalues and resolvent of A. Also, we study the resolvent of the extension $A$ of A to the corresponding negative space.